On eigenvalue decomposition estimators of centro-symmetric covariance matrices
نویسنده
چکیده
This paper is focused on estimators, both batch and adaptive, of the eigenvalue decomposition (EVD) of centrosymmetric (CS) covariance matrices. These estimators make use of the property that eigenvectors and eigenvalues of such structured matrices can be estimated via two decoupled eigensystems. As a result, the number of operations is roughly halved, and moreover, the statistical properties of the estimators are improved. After deriving the asymptotic distribution of the EVD estimators, the closed-form expressions of the asymptotic bias and covariance of the EVD estimators are compared to those obtained when the CS structure is not taken into account. As a by-product, we show that the closed-form expressions of the asymptotic bias and covariance of the batch and adaptive EVD estimators are very similar provided that the number of samples is replaced by the inverse of the step size. Finally, the accuracy of our asymptotic analysis is checked by numerical simulations, and it is found that the convergence speed is also improved thanks to the use of the CS structure. ( 1999 Elsevier Science B.V. All rights reserved.
منابع مشابه
On adaptive EVD asymptotic distribution of centro-symmetric covariance matrices
This correspondence investigates the gain in statistical performance/complexity of the adaptive estimation of the eigenvalue decomposition (EVD) of covariance matrices when the centrosymmetric (CS) structure of such matrices is utilized. After deriving the asymptotic distribution of the EVD estimators, it is shown, in particular, that the closed-form expressions for the asymptotic covariance of...
متن کاملProperties of eigenvalue function
For the eigenvalue function on symmetric matrices, we have gathered a number of it’s properties.We show that this map has the properties of continuity, strict continuity, directional differentiability, Frechet differentiability, continuous differentiability. Eigenvalue function will be extended to a larger set of matrices and then the listed properties will prove again.
متن کاملParallelizable eigenvalue decomposition techniques via the matrix sector function
Many modern high-resolution spectral estimators in signal processing and control make use of the subspace information afforded by the singular value decomposition of the data matrix, or the eigenvalue decomposition of the covariance matrix. The derivation of these estimators involves some form of matrix decomposition. In this paper, new computational techniques for obtaining eigenvalues and eig...
متن کاملEstimation of normal covariance matrices parametrized by irreducible symmetric cones under Stein’s loss
In this paper the problem of estimating a covariance matrix parametrized by an irreducible symmetric cone in a decision-theoretic set-up is considered. By making use of some results developed in a theory of finite-dimensional Euclidean simple Jordan algebras, Bartlett’s decomposition and an unbiased risk estimate formula for a general family of Wishart distributions on the irreducible symmetric...
متن کاملSome results on the symmetric doubly stochastic inverse eigenvalue problem
The symmetric doubly stochastic inverse eigenvalue problem (hereafter SDIEP) is to determine the necessary and sufficient conditions for an $n$-tuple $sigma=(1,lambda_{2},lambda_{3},ldots,lambda_{n})in mathbb{R}^{n}$ with $|lambda_{i}|leq 1,~i=1,2,ldots,n$, to be the spectrum of an $ntimes n$ symmetric doubly stochastic matrix $A$. If there exists an $ntimes n$ symmetric doubly stochastic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Signal Processing
دوره 78 شماره
صفحات -
تاریخ انتشار 1999